#include<bits/stdc++.h>
using namespace std;
int a[100001];
priority_queue<int,vector<int>,greater<int>> q;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n,tmp,tmp1,tmp2;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    q.push(a[1]);
    for(int i=2;i<=n;i++){
        if(q.top()<a[i]){
            q.pop();
            q.push(a[i]);
        }else{
            q.push(a[i]);
        }
    }
    cout<<q.size();
    return 0;
}
